An Analysis of Sum-Based Incommensurable Belief Base Merging
نویسندگان
چکیده
Different methods have been proposed for merging multiple and potentially conflicting informations. Sum-based operators offer a natural method for merging commensurable prioritized belief bases. Their popularity is due to the fact that they satisfy the majority property and they adopt a non cautious attitude in deriving plausible conclusions. This paper analyses the sum-based merging operator when sources to merge are incommensurable, namely they do not share the same meaning of uncertainty scales. We first show that the obtained merging operator can be equivalently characterized either in terms of an infinite set of compatible scales, or by a well-known Pareto ordering on a set of models. We then study different families of compatible scales useful for merging process. This paper also provides a postulates-based analysis of our merging operators.
منابع مشابه
An Egalitarist Fusion of Incommensurable Ranked Belief Bases under Constraints
In the last decade, several approaches have been proposed for merging multiple and potentially conflicting pieces of information. Egalitarist fusion modes privilege solutions that minimize the (local) dissatisfaction of each agent (source, expert) who is involved in the fusion process. This paper proposes useful strategies for an egalitarist fusion of incommensurable ranked belief bases under c...
متن کاملSur la fusion de croyances égalitaire
There are two main sub-families of IC merging operators : majority operators and arbitration ones. While many majority belief merging operators have been defined so far, only few arbitration belief merging operators have been identified. In this paper, we study the more general notion of egalitarian belief merging. We translate to the belief merging framework two egalitarian conditions coming f...
متن کاملMerging Incommensurable Possibilistic DL-Lite Assertional Bases
This short paper studies the problem of merging of different independent data sources linked to a lightweight ontology under the incommensurability assumption. In general, data are often provided by several and potentially conflicting sources of information having different levels of priority. To encode prioritized assertional bases, we use possibilistic DLLite logic. We investigate an egalitar...
متن کاملA consistency-based framework for merging knowledge bases
We present a framework for expressing various merging operators for belief sets. This framework generalises our earlier work on consistency-based belief revision and contraction. Two primary merging operators are identified: in the first approach, belief sources are consistently combined so that the result of merging knowledge bases K1, . . . ,Kn is a maximal consistent (if possible) set of for...
متن کاملSAT Encodings for Distance-Based Belief Merging Operators
We present SAT encoding schemes for distance-based belief merging operators relying on the (possibly weighted) drastic distance or the Hamming distance between interpretations, and using sum, GMax (leximax) or GMin (leximin) as aggregation function. In order to evaluate these encoding schemes, we generated benchmarks of a time-tabling problem and translated them into belief merging instances. T...
متن کامل